The Reachability problem for nitecellular automataAndrea
نویسنده
چکیده
(Part of the results presented in this paper have already appeared in 5])-Abstract We investigate the complexity of the Con-guration REachability Problem (CREP) for two classes of nite weakly predictable cellular automata: the invertible and the additive ones. In both cases we prove that CREP belongs tp the \Arthur-Merlin" class CoAMM2].
منابع مشابه
Reachability checking in complex and concurrent software systems using intelligent search methods
Software system verification is an efficient technique for ensuring the correctness of a software product, especially in safety-critical systems in which a small bug may have disastrous consequences. The goal of software verification is to ensure that the product fulfills the requirements. Studies show that the cost of finding and fixing errors in design time is less than finding and fixing the...
متن کاملAcceleration For Presburger Petri Nets
The reachability problem for Petri nets is a central problem of net theory. The problem is known to be decidable by inductive invariants definable in the Presburger arithmetic. When the reachability set is definable in the Presburger arithmetic, the existence of such an inductive invariant is immediate. However, in this case, the computation of a Presburger formula denoting the reachability set...
متن کاملThe reachability problem for Vector Addition System with one zero-test by Leroux method
We consider here a variation of Vector Addition Systems where one counter can be tested for zero, extending the reachability proof by Leroux for Vector Addition System to our model. This provides an alternate, and hopefully simpler to understand, proof of the reachability problem that was originally proved by Reinhardt.
متن کاملSemilinearity of Vector Addition Systems with States
The decidability of the reachability problem for VASS has been open for a long time, and today the computational complexity of the problem is still open. Obviously, there is more hope of obtaining elementary complexity upper bounds by restricting the class of VASS, for example by considering those for which the reachability sets are effectively semilinear. Presburger arithmetic would then provi...
متن کاملReachability in Live and Safe Free - Choice
The complexity of the reachability problem for live and safe free-choice Petri nets has been open for several years. Several partial results seemed to indicate that the problem is polynomial. We show that this is unlikely: the problem is NP-complete.
متن کامل